Satin: Efficient Parallel Divide-and-Conquer in Java
نویسندگان
چکیده
Satin is a system for running divide and conquer programs on distributed memory systems (and ultimately on wide-area metacomputing systems). Satin extends Java with three simple Cilk-like primitives for divide and conquer programming. The Satin compiler and runtime system cooperate to implement these primitives efficiently on a distributed system, using work stealing to distribute the jobs. Satin optimizes the overhead of local jobs using on-demand serialization, which avoids copying and serialization of parameters for jobs that are not stolen. This optimization is implemented using explicit invocation records. We have implemented Satin by extending the Manta compiler. We discuss the performance of four applications on a Myrinet-based cluster.
منابع مشابه
Satin: Simple and Efficient Java-based Grid Programming
Grid programming environments need to be both portable and efficient to exploit the computational power of dynamically available resources. In previous work, we have presented the divide-and-conquer based Satin model for parallel computing on clustered wide-area systems. In this paper, we present the Satin implementation on top of our new Ibis platform which combines Java’s write once, run ever...
متن کاملGenerating synchronization statements in divide-and-conquer programs
0167-8191/$ see front matter 2011 Elsevier B.V doi:10.1016/j.parco.2011.10.007 ⇑ Corresponding author. E-mail addresses: [email protected] (P. Hijma), rob Divide-and-conquer is a well-known and important programming model that supports efficient execution of parallel applications on multi-cores, clusters, and grids. In divideand-conquer systems such as Satin or Cilk, recursive calls are automatic...
متن کاملAdaptive Load Balancing for Divide-and-Conquer Grid Applications
Divide-and-conquer has been demonstrated as a simple and efficient programming model for grid applications. In previous work, we have presented the divide-and-conquer based Satin system and its load balancing algorithm, clusteraware work stealing (CRS). In this paper, we provide a detailed analysis of CRS with respect to important properties of grid systems, namely scalability, heterogeneous co...
متن کاملFree Vibration Analysis of Repetitive Structures using Decomposition, and Divide-Conquer Methods
This paper consists of three sections. In the first section an efficient method is used for decomposition of the canonical matrices associated with repetitive structures. to this end, cylindrical coordinate system, as well as a special numbering scheme were employed. In the second section, divide and conquer method have been used for eigensolution of these structures, where the matrices are in ...
متن کاملFault-Tolerant Scheduling of Fine-Grained Tasks in Grid Environments
Divide-and-conquer is a well-suited programming paradigm for parallel Grid applications. Our Satin system efficiently schedules the fine-grained tasks of a divide-andconquer application across multiple clusters in a grid. To accommodate long-running applications, we present a fault-tolerance mechanism for Satin that has negligible overhead during normal execution, while minimizing the amount of...
متن کامل